Bonded deficit round robin scheduling for multi-channel networks
نویسندگان
چکیده
1389-1286/$ see front matter 2011 Elsevier B.V doi:10.1016/j.comnet.2011.07.007 ⇑ Corresponding author at: London Center for Nan Street 17-19, WC1H 0AH, London, UK. Tel.: +44 798 E-mail address: [email protected] (D. N In order to increase the link capacity in telecommunication networks the bandwidth of multiple channels can be aggregated by transmitting on them simultaneously. The latest data-over-cable service interface specification (DOCSIS 3.0) for hybrid fiber coax networks defines a mechanism for channel bonding at the link layer. Thus, the scheduler at the cable modem termination system, which distributes the packets on the network, not only has to support per-flow queuing but also has to distribute the packets to one modem over possibly several channels. In this article we propose two downstream multi-channel packet scheduling algorithms designed to support scheduling amongst flows possibly using different numbers of channels. Both algorithms are based on the deficit round robin (DRR) scheduler. The bonded deficit round robin (BDRR) algorithm, has complexity dependent only on the number of the channels and requires only one queue per flow. It is shown that the algorithm is a latency-rate server and the latency is derived. Furthermore, BDRR bounds the packet reordering and the maximum bounds on the packet delay and the reorder buffer needed at the receiver are calculated. The paper explores also a second algorithm which has more similarities with load balancing algorithms. It uses fully independent channel schedulers thus avoiding the need for modification in the single channel DRR algorithm. The transmission channel for a packet is selected upon its arrival. However, the algorithm does not bound the latency and packet reorder for flows assigned to receive on multiple channels. Flows for which such bound is needed should be assigned on a single channel. 2011 Elsevier B.V. All rights reserved.
منابع مشابه
On Channel and Transport Layer aware Scheduling and Congestion Control in Wireless Networks
In this thesis, we consider resource allocation schemes for infrastructure-based multipoint-topoint wireless networks like IEEE 802.16 networks and infrastructure-less ad-hoc networks. In the multipoint-to-point networks, we propose channel and Transport layer aware uplink scheduling schemes for both real-time and best effort services, whereas in ad-hoc networks, we propose channel aware conges...
متن کاملEvaluation of Surplus Round Robin Scheduling Algorithm
In multi-service packet networks the packet scheduling algorithm plays a key role in delivering guaranteed service to different flows. In this article we evaluate surplus round robin (SRR) scheduling algorithm. We apply the Latency-Rate (LR) servers theory in order to obtain bounds on the latency and delay provided by the algorithm. We compare the performance characteristics of SRR with the pop...
متن کاملStability Improvement of Hydraulic Turbine Regulating System Using Round-Robin Scheduling Algorithm
The sustainability of hydraulic turbines was one of the most important issues considered by electrical energy provider experts. Increased electromechanical oscillation damping is one of the key issues in the turbines sustainability. Electromechanical oscillations, if not quickly damp, can threaten the stability of hydraulic turbines and causes the separation of different parts of the netw...
متن کاملDeficit Round Robin with Fragmentation Scheduling to Achieve Generalized Weighted Fairness for Resource Allocation in IEEE 802.16e Mobile WiMAX Networks
Deficit Round Robin (DRR) is a fair packet-based scheduling discipline commonly used in wired networks where link capacities do not change with time. However, in wireless networks, especially wireless broadband networks, i.e., IEEE 802.16e Mobile WiMAX, there are two main considerations violate the packet-based service concept for DRR. First, the resources are allocated per Mobile WiMAX frame. ...
متن کاملFair , Efficient and Scalable Scheduling Without Per - Flow State ∗
In recent years, parallel computer systems are being increasingly used in multi-user environments, with several users sharing the interconnection network at the same time. As a result a large number frequently contend for link bandwidth at the core switches in the network. Traditional fair scheduling disciplines need to maintain per-flow states and perform packet scheduling on a per-flow basis,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computer Networks
دوره 55 شماره
صفحات -
تاریخ انتشار 2011